Step-optimal implementations of large single-writer registers
نویسندگان
چکیده
منابع مشابه
Step Optimal Implementations of Large Single-Writer Registers
We present two wait-free algorithms for simulating an `-bit single-writer register from k-bit single-writer registers, for any k ≥ 1. Our first algorithm has Θ(`/k) step complexity for both Read and Write and uses Θ(4`−k) registers. An interesting feature of the algorithm is that Read operations do not write to shared variables. Our second algorithm has Θ(`/k+ (logn)/k) step complexity for both...
متن کاملProgress-Space Tradeoffs in Single-Writer Memory Implementations
Many algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register that can only be written by the process and read by all. In a system where computation is performed by a bounded number n of processes coming from a large (possibly unbounded) set of potential participants, the assumption of an...
متن کاملFaster Approximate Agreement with Multi-Writer Registers
We consider the complexity of the wait-free approximate agreement problem in an asynchronous shared memory comprised of only single-bit multi-writer multi-reader registers. For real-valued inputs of magnitude at most s and a real-valued accuracy requirement " > 0 we show matching upper and lower bounds of (log(s=")) steps and shared registers. For inputs drawn from any xed nite range this is si...
متن کاملRandomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
A new weak shared coin protocol yields a randomized waitfree shared-memory consensus protocol that uses an optimal O(n) expected total work with single-writer registers despite asynchrony and process crashes. Previously, no protocol was known that achieved this bound without using multi-writer registers.
متن کاملAn Explicit Single-step Method for Numerical Solution of Optimal Control Problems
In this research we used forward-backward sweep method(FBSM) in order to solve optimal control problems. In this paper, one hybrid method based on ERK method of order 4 and 5 are proposed for the numerical approximation of the OCP. The convergence of the new method has been proved .This method indicate more accurate numerical results compared with those of ERK method of order 4 and 5 for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.04.008